Dingo algorithm-based forwarder selection and huffman coding to improve authentication
نویسندگان
چکیده
<span>In wireless sensor network (WSN), the high volume of observe and transmitted data among nodes make it requires to maintain security. Even though numerous secure transmission approaches designed over a network, an inadequate resource complex environment cause not able used in WSNs. Moreover, communication is big challenging problem WSNs especially for military application. This paper proposes dingo algorithm-based forwarder selection huffman coding (DAHC) improve authentication internet things (IoT) WSN. Initially, detects anomalous by applying support vector machine (SVM) algorithm based on node energy, selfishness, signal noise ratio (SNR). Next, we using select node. computes fitness function degreee, distance energy. Finally, provide end established energy from sender receiver. During transmission, build binary hop count value, improves Performance results specify that this approach enhances detection throughput.</span>
منابع مشابه
Ternary Tree and Clustering Based Huffman Coding Algorithm
In this study, the focus was on the use of ternary tree over binary tree. Here, a new two pass Algorithm for encoding Huffman ternary tree codes was implemented. In this algorithm we tried to find out the codeword length of the symbol. Here I used the concept of Huffman encoding. Huffman encoding was a two pass problem. Here the first pass was to collect the letter frequencies. You need to use ...
متن کاملPerformance Analysis of Huffman Coding Algorithm
Huffman coding is such a widespread method for creating prefix-free codes. Huffman code is used as a synonym for prefix-free code even when such a code is not produced by Huffman's algorithm. Huffman coding is an efficient source coding algorithm for source symbols that are not equally probable. It yields the smallest possible number of code symbols per source symbol [7]. In this paper, the Los...
متن کاملBetter Huffman Coding via Genetic Algorithm
We present an approach to compress arbitrary files using a Huffman-like prefix-free code generated through the use of a genetic algorithm, thus requiring no prior knowledge of substring frequencies in the original file. This approach also enables multiple-character substrings to be encoded. We demonstrate, through testing on various different formats of real-world data, that in some domains, th...
متن کاملHuffman-Based Test Response Coding
Test compression / decompression is an efficient method for reducing the test application cost. In this letter we propose a response compression method based on Huffman coding. The proposed method guarantees zero-aliasing and it is independent of the fault model and the structure of a circuit-under-test. Experimental results of the compression ratio and the size of the encoder for the proposed ...
متن کاملHuffman Modeling for DCT Based Coding
In this paper we present a statistical modeling for DCT events frequency distribution for three images classes: landscape, portrait and document. We show that it is possible to fit a mathematical model capturing the underlying statistical distribution. This modeling allows us to automatically generate optimized Huffman tables for each quality factor involved in the compression engine.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2023
ISSN: ['2502-4752', '2502-4760']
DOI: https://doi.org/10.11591/ijeecs.v32.i1.pp432-440